public class ClimbStairs {
    // leetcode 爬楼梯
    // https://leetcode.cn/problems/climbing-stairs/description/?envType=study-plan-v2&envId=top-100-liked
    public int climbStairs(int n) {
        // dp[i]表示爬到第i级台阶有dp[i]种方式
        int[] dp = new int[n+1];
        dp[0] = 1;
        dp[1] = 1;
        for (int i = 2; i < n + 1; i++) {
            dp[i] = dp[i-1] + dp[i-2];
        }
        return dp[n];
    }
}
